Relative Entropy Model of Uncertain Random Shortest Path

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Shortest path problem of uncertain random network

The shortest path problem is one of the most fundamental problems in network optimization. This paper is concerned with shortest path problems in non-deterministic environment, in which the lengths of some arcs have stochastic characteristics and meanwhile some have uncertain characteristics. In order to investigate paths in these networks, this paper introduces the chance distribution of minim...

متن کامل

Stochastic Shortest Path Problem with Uncertain Delays

This paper considers a stochastic version of the shortest path problem, the Stochastic Shortest Path Problem with Delay Excess Penalty on directed, acyclic graphs. In this model, the arc costs are deterministic, while each arc has a random delay, assumed normally distributed. A penalty occurs when the given delay constraint is not satisfied. The objective is to minimize the sum of the path cost...

متن کامل

Robust shortest path problems with uncertain costs

Data coming from real-world applications are very often affected by uncertainty. On the other hand, it is difficult to translate uncertainty in terms of combinatorial optimization. In this paper we study a combinatorial optimization model to deal with uncertainty in arc costs in shortest path problems. We consider a model where feasible arc cost scenarios are described via a convex polytope. We...

متن کامل

Shortest Path through Random Points

Let (M, g1) be a compact d-dimensional Riemannian manifold. Let Xn be a set of n sample points in M drawn randomly from a Lebesgue density f . Define two points x, y ∈ M . We prove that the normalized length of the power-weighted shortest path between x, y passing through Xn converges to the Riemannian distance between x, y under the metric gp = f g1, where p > 1 is the power parameter. The res...

متن کامل

Partial entropy of uncertain random variables

In this paper, we mainly propose a definition of partial entropy for uncertain random variables. In fact, partial entropy is a tool to characterize how much of entropy of an uncertain random variable belongs to the uncertain variable. Furthermore, some properties of partial quadratic entropy are investigated such as positive linearity. Finally, some other types of partial entropies are studied.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: International Journal of e-Navigation and Maritime Economy

سال: 2015

ISSN: 2405-5352

DOI: 10.1016/j.enavi.2015.06.008